The Perception-Action Model: Counting Computational Mechanisms
نویسندگان
چکیده
منابع مشابه
Towards the Computational Perception of Action
Understanding observations of interacting objects requires one to reason about qualitative scene dynamics. For example, on observing a hand lifting a can, we may infer that an ‘active’ hand is applying an upwards force (by grasping) to lift a ‘passive’ can. In previous work [6] we presented a system that infers qualitative scene dynamics from the instantaneous motion of objects. However, since ...
متن کاملPlanned action determines perception: A computational model of saccadic mislocalization
Studies that investigated perception around saccadic eye movements reported a mislocalization of briefly flashed stimuli. We propose an anatomically and physiologically plausible model in which mislocalization originates early in the visual pathway through spatial reentry.
متن کاملThe Different Mechanisms of Action Potential Propagation in the Heart
It was thought previously that cardiac muscle gap junctions provide low-resistance connections between cells and permit the local-circuit current to flow. Some evidences show that myocardial cells may not require low-resistance connections for successful propagation of the action potential (AP). It seems that some other types of mechanisms must be involved in AP propagation. In this article, we...
متن کاملThe Different Mechanisms of Action Potential Propagation in the Heart
It was thought previously that cardiac muscle gap junctions provide low-resistance connections between cells and permit the local-circuit current to flow. Some evidences show that myocardial cells may not require low-resistance connections for successful propagation of the action potential (AP). It seems that some other types of mechanisms must be involved in AP propagation. In this article, we...
متن کاملThe Computational Complexity of Counting
The complexity theory of counting contrasts intriguingly with that of existence or optimization. 1. Counting versus existence The branch of theoretical computer science known as computational complexity is concerned with quantifying the computational resources required to achieve specified computational goals. Classically, the goal is often to decide the existence of a certain combinatorial str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mind & Language
سال: 2017
ISSN: 0268-1064
DOI: 10.1111/mila.12147